Timing Driven Functional Decomposition for FPGAs
نویسندگان
چکیده
This work explores the effect of adding a timing driven functional decomposition step to the traditional field programmable gate array (FPGA) CAD flow. Once placement has completed, alternative decompositions of the logic on the critical path are examined for potential delay improvements. The placed circuit is then modified to use the best decompositions found. Any placement illegalities introduced by the new decompositions are resolved by an incremental placement step. Experiments conducted on Altera’s Stratix and Stratix II device families indicate that this functional decomposition technique can provide average performance improvements of 6.1% and 5.6% on a large set of industrial designs, respectively.
منابع مشابه
A Timing-Driven Global Router for Symmetrical Array Based FPGAs
In this paper, we present a timing-driven global router for symmetrical array-based architecture FPGAs. The routing resources in symmetrical array based FPGAs consist of segments of various lengths. The timing constraints are speciied as delay bounds on source-sink pairs of nets. The algorithm proceeds in a hierarchical top-down manner and is able to utilize various routing segments with global...
متن کاملEffective and Efficient Circuit Synthesis for LUT FPGAs Based on Functional Decomposition and Information Relationship Measures
The narrowing opportunity window and the dramatically increasing development costs of deep sub-micron application specific integrated circuit (ASIC) designs have presented new challenges to the development process. The cost of ASICs development and fabrication is presently so high that more and more companies are seeking alternative implementation platforms. Today, programmable logic devices (P...
متن کاملTiming Driven C-Slow Retiming on RTL for MultiCores on FPGAs
In this paper C-Slow Retiming (CSR) on RTL is discussed. CSR multiplies the functionality of cores by adding the same number of registers into each path. The technique is ideal for FPGAs with their already existing registers. Previously publications are limited to adding registers on netlist level, which generates a lot of system verification problems and which is assumed to be the major drawba...
متن کاملTiming Driven Multi-FPGA Board Partitioning
System level design is increasingly turning towards FPGAs to take advantage of their low cost and fast prototyping. In this paper we present a timing driven partitioning approach for architecturally constrained reconngurable multi-FPGA systems. The partitioning approach using a Path-based clustering based on the attraction function proposed by Kahng et.al 19] followed by FM based min-cut partit...
متن کاملTiming-Driven Routing for Symmetrical-Array-Based FPGAs yz
Kai Zhu1, Yao-Wen Chang2, and D. F. Wong3 1Triscend Corp., 301 N. Whisman Rd., Mountain View, CA 94043, USA 2Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan 3Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712, USA Abstract In this paper, we present a timing-driven global router for symmetrical-array-based FPGAs...
متن کامل